Mobile peer-to-peer content sharing method and system

ABSTRACT

Embodiment of the disclosure set forth methods for sharing data in a wireless network. Some example methods include storing in a database a content related information associated with a first mobile device, receiving a request for the content related information from a second mobile device, searching the database for the content related information, and transmitting a search result to the second mobile device to enable the transfer of content between the first mobile device and the second mobile device.

BACKGROUND OF THE DISCLOSURE Description of the Related Art

As mobile devices become ubiquitous and affordable, they are also beingtransformed from a simple communication tool to an information andentertainment center. For example, mobile devices are often used toaccess the various assets on the Internet, such as information,bandwidth, and computing resources. There are existing approaches thatattempt to advance mobile peer-to-peer (P2P) computing or networkingtechnologies to further augment the utilization of these Internet assetsand enable the mobile devices to share resources directly with oneanother. However, with the inherent mobile nature of the mobile devices,many of these approaches are faced with adoption issues.

SUMMARY OF THE DISCLOSURE

A mobile peer-to-peer content sharing method and system is disclosed.One embodiment of the disclosure sets forth a method for sharing data ina wireless network. The method includes the steps of establishing atopology of the wireless network, storing location and content relatedinformation associated with a first mobile device in the wirelessnetwork in a database, searching the database for the content relatedinformation in response to a content request associated with a secondmobile device in the wireless network, and transmitting a search resultto the second mobile device for the transfer of the content between thefirst mobile device and the second mobile A method for.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other features of the present disclosure will becomemore fully apparent from the following description and appended claims,taken in conjunction with the accompanying drawings. Understanding thatthese drawings depict only several embodiments in accordance with thedisclosure and are, therefore, not to be considered limiting of itsscope, the disclosure will be described with additional specificity anddetail through use of the accompanying drawings.

FIG. 1A illustrates one configuration of a P2P wireless network;

FIG. 1B illustrates a configuration of another P2P wireless network;

FIG. 2A is a timing diagram illustrating a sequence of discovering apeer in a P2P wireless network and sending information to the peer by aMSC;

FIG. 2B is a flow chart illustrating a process performed by a MSC inresponse to a MS entering a coverage area of a BS managed by the MSC;

FIG. 3 is a timing diagram illustrating a content request sequence;

FIG. 4A is a timing diagram illustrating a sequence for keeping thestate information of a MS current in a centralized database;

FIG. 4B is a flow chart further illustrating a process for maintainingthe state information of a MS;

FIG. 5A illustrates one type of handoff;

FIG. 5B illustrates another type of a handoff;

FIG. 6 is a flow chart illustrating a process for handling data transferamong peers in a P2P wireless network;

FIG. 7 is a flow chart illustrating a process of uploading content to aBS;

FIG. 8 is a simplified diagram illustrating a virtual money path in anincentive mechanism for a P2P wireless network;

FIG. 9A is a flow chart illustrating a process for administering atransmit power credit based system;

FIG. 9B is a flow chart illustrating a process for adjusting a transmitpower credit based system; and

FIG. 10 is a block diagram illustrating a computer program product of asoftware module for a MS, a BS, or a MSC, all arranged in accordancewith embodiments of the present disclosure.

DETAILED DESCRIPTION

In the following detailed description, reference is made to theaccompanying drawings, which form a part hereof. In the drawings,similar symbols typically identify similar components, unless contextdictates otherwise. The illustrative embodiments described in thedetailed description, drawings, and claims are not meant to be limiting.Other embodiments may be utilized, and other changes may be made,without departing from the spirit or scope of the subject matterpresented here. It will be readily understood that the aspects of thepresent disclosure, as generally described herein, and illustrated inthe Figures, can be arranged, substituted, combined, and designed in awide variety of different configurations, all of which are explicitlycontemplated and make part of this disclosure.

This disclosure is drawn, inter alia, to methods, apparatus, computerprograms, and systems related to peer-to-peer content sharing in awireless network.

In this disclosure, a wireless network that supports peer-to-peer (P2P)technologies (also referred to as P2P wireless network or P2P mobilenetwork) may be used to build a wide range of distributed services andapplications. Any device with wireless connectivity and addressable inthe P2P wireless network is referred to as a peer. A wireless networkgenerally includes at least one stationary device and at least onemobile station (MS). Some examples of a stationary device include,without limitation, a base station (BS) and a mobile switch center(MSC). A BS is configured to cover a wireless range, and a MSC isconfigured to manage one or more BS's in a wireless network. A MSgenerally refers to a portable device with wireless connectivity. Someexamples of a MS include, without limitation, a mobile phone, a personaldigital assistant (PDA), a laptop computer with wireless connectivity,and a personal game console with wireless connectivity. A mesh networkrefers to a network with nodes that communicate directly with each otherthrough wireless connections. Instead of going through a designatedrouter, data packets in a mesh network are forwarded from node to nodein a process typically termed “hopping.”

FIG. 1A illustrates one configuration of a P2P wireless network 100,arranged in accordance with the embodiments of the present disclosure.The P2P wireless network 100 includes a MSC 102, a centralized database104, a plurality of BS's (e.g., BS 106 and BS 108), and a plurality ofMS's (e.g., MS 110, MS 112, MS 114, MS 116, and MS 118). The MS's ofFIG. 1A are also considered as peers in the P2P wireless network 100.The wireless technology used in the P2P wireless network 100 mayinclude, without limitation, wide area cellular technology (e.g., 3G and4G), wireless networking technology (e.g., Wireless Fidelity or Wi-Fi,Worldwide Interoperability for Microwave Access or WiMAX, and ThirdGeneration Partnership Project (Long Term Evolution) or 3GPP LTE).

In FIG. 1A, the MSC 102 is configured to manage the BS 106 and the BS108. The BS 106 and the BS 108 are configured to communicate with theMS's that are in their respective communication ranges. The MSC 102 iscoupled to the centralized database 104 and can access the centralizeddatabase 104. The centralized database 104 may be physically locatedwithin or external to the MSC 102. The centralized database 104 isarranged to store data received from the BS's and the MS's. Someexamples of the stored data include, without limitation, identificationof a MS, location of a MS, the relationship between a BS and a MS,identification of a BS, and content related information (e.g.,availability of content, a tag associated with content, a key worddescribing content, and size of content). In one implementation, theidentification of a MS may refer to an Internet Protocol (IP) address ora Media Access Control (MAC) address assigned to the MS.

A BS, such as the BS 106 covering the MS 110, MS 112, and MS 114, isconfigured to maintain communication links with the MS's and query theMS's for certain state information. Also, the BS 106 is configured todistribute data to any of the MS 110, MS 112, and MS 114. Since the BS106 reports information back to the MSC 102 and the MSC 102 maintainsthe reported information in the centralized database 104, with access tothe centralized database 104, the MSC 102 is able to keep track of thetopology of the P2P wireless network 100 and the relationships among thepeers in the network.

FIG. 1B illustrates a configuration of another P2P wireless network 150,arranged in accordance with embodiments of the present disclosure. Here,the N MS's are coupled to one another in a mesh network 158, where oneof the MS's, MS1, is connected to a BS 156. The MS's are peers in theP2P wireless network 150. In some implementations, the N peers canexchange data with each other in the mesh network 158 without goingthrough the BS 156. To increase redundancy and mitigate losingconnections to the peers as each peer moves from one coverage area toanother, one approach is to increase the number of N as a function ofthe historical data on properties of MS. The value of N can beadaptively determined by the following equation:

N=alpha*T1+beta

where alpha and beta are constants determined by the MSC 154. Using MS Nas an example, T1 is the average duration of time that the MS N stays inan area covered by the same MSC 154 after the MS N makes the initialcontact with the MSC 154.

In some implementations, when a MS in a P2P wireless network seeks toretrieve content from a peer, the MS looks to an appropriate MSC for thecurrent information regarding the availability and the location of therequested content. For the MSC to obtain and disseminate suchinformation, various mechanisms are implemented. Using the P2P wirelessnetwork 100 of FIG. 1A as an example, one mechanism is for the MSC 102to discover all the MS's that are covered by the BS's managed by the MSC102 (e.g., BS 106 and BS 108) and exchange data with the MS's throughthe BS's. Another example mechanism is for the MSC 102 to search thecentralized database 104 in response to receiving a content request froma MS. Still another mechanism is for the MSC 102 to query the peers inthe P2P wireless network, keep the state information associated with thepeers up to date, and respond to changing state information, if any.Detailed discussions of these mechanisms are provided in the subsequentparagraphs.

FIG. 2A is a timing diagram illustrating a sequence of discovering apeer in a P2P wireless network and sending information to the peer by aMSC, arranged in accordance with embodiments of the present disclosure.In some implementations, when a MS 202 is in an area covered by a BS206, the MS 202 transmits a join request signal 204 to the BS 206, whichthen sends an update signal 208 to a MSC 210. The join request signal204 may include the identification and the location information of theMS 202. When the MSC 210 receives the update signal 208 from the BS 206,the MSC 210 stores the received information to a centralized database212. The MSC 210 may also process the received information, such as,without limitation, establishing an appropriate number of peers to forma mesh network in the P2P wireless network as mentioned above. Then, theMSC 210 transmits information, such as, without limitation, theestablished number of peers and/or the status of connection between theMSC 210 and the MS 202, to the MS 202 via the BS 206.

In conjunction with FIG. 2A, FIG. 2B is a flow chart illustrating aprocess performed by a MSC in response to a MS entering a coverage areaof a BS managed by the MSC, arranged in accordance with embodiments ofthe present disclosure. In operation 214, the MSC 210 receivesinformation associated with the MS 202 through the update signal 208from the BS 206. The MSC 210 then in operation 216 stores the receivedinformation in the centralized database 212 and may also process thereceived information. In operation 218, the MSC 210 sends informationindicative of the peering information in the P2P wireless network and/orconnection status, for example, to the MS 202 via the BS 206.

After a MSC and a MS exchange data, FIG. 3 is a timing diagramillustrating a content request sequence, arranged in accordance withembodiments of the present disclosure. Suppose a MSC 306 has discovereda MS 302 and has stored information received from the MS 302 in acentralized database 308 via a BS 306. In some implementations, the MS302 requests for content by transmitting an inquire signal to the BS304, which then forwards the inquire signal to the MSC 306. The inquiresignal may include certain information associated with the requestedcontent, such as a keyword, a tag, and size information. After receivingthe inquire signal, the MSC 306 searches in the centralized database 308for the requested content and also the identities of the one or moreMS's that have the content. The MSC 306 then sends a reply signal withthe search results to the BS 306, which relays the reply signal to theMS 302. The reply signal may include, without limitation, the locationof the MS having the requested content and the identification of the BScovering such a MS. It should be noted that the aforementioned contentrequest sequence also covers scenarios in which the requested contentresides in more than one MS.

Especially given the mobility nature of MS's, state informationassociated with a MS does not typically remain static. Some examples ofthe state information include, without limitation, location, contentavailability, transmission capability, and use associated with a MS.

FIG. 4A is a timing diagram illustrating a sequence for keeping thestate information of a MS current in a centralized database 402,arranged in accordance with embodiments of the present disclosure. Thecentralized database 402 is generally configured to receive the stateinformation of a MS through a MSC 404. In some implementations, the MSC404 issues a query signal from time to time to a BS 406 requesting forstate information associated with a MS 408. The BS 406 relays the querysignal to the MS 408. In response, the MS 408 sends a reply signal 410to the BS 406, and the BS 406 then sends an update signal 412 to the MSC404. The reply signal 410 and the update signal 412 both include thecurrent state information associated with the MS 408. Alternatively, thestate information of the MS 408 can be maintained and kept current bythe BS 406.

From the perspective of a BS, FIG. 4B is a flow chart furtherillustrating a process for maintaining the state information of a MS,arranged in accordance with embodiments of the present disclosure. Inconjunction with FIG. 4A, in response to a query signal from the MSC404, the BS 406 transmits a query signal to the MS 408 for a statusupdate in operation 414. In operation 416, the BS 406 waits for thereply signal 410 from the MS 408 to determine the connection status withthe MS 406. If the reply signal 410 is received, then the BS 406establishes that the communication link with the MS 408 is still validin operation 418. On the other hand, if the reply signal 410 is notreceived by the BS 406, then the BS 406 determines that thecommunication link with the MS 408 is no longer valid in operation 420.In operation 422, the BS 406 reports the determination results, such asthe communication link status, back to the MSC 404 to be stored in thecentralized database 402.

In some implementations, when a communication link associated with a MSis determined to be invalid (e.g., the MS moving into a different areacovered by another BS), the process of peer discovery as illustrated inFIGS. 2A and 2B and discussed above is re-initiated, and the stateinformation obtained prior to the invalidity determination of thecommunication link is abolished.

In some examples, the process of polling and dissemination of controlinformation in a P2P wireless network can be streamlined by utilizingexisting control signal paths between a MS and a BS. Using FIG. 4A as anexample, suppose the MS 408 sends a join request to the BS 406 via anestablished control signal path in a first scenario (e.g., the MS 408awaking from a sleeping mode and requesting to establish a new dataconnection with the BS 406.) In some implementations, the MS 408 canalso utilize the same control signal path to send the content request ina second scenario (e.g., the MS 408 requesting for certain content). Inother words, the MS 408 does not need to establish a control signal pathspecifically for sending the content request. The piggybacking of theexisting control signal paths to poll and disseminate data simplifiescommunications, prevents possible packet collisions, and conserves powerfor the peers in the P2P wireless network.

As a MS moves from one area covered by a first BS to another areacovered by a second BS in a P2P wireless network, certain datainformation associated with the BS is also transferred from the first BSto the second BS to maintain the connectivity of the MS to the P2Pwireless network. This data transfer process is generally referred to asa handoff.

FIG. 5A illustrates one type of handoff, arranged in accordance withembodiments of the present disclosure. Here, as a MS 505 moves from afirst coverage area of a BS 502 into a second coverage area of a BS 504,the connection between the MS 505 and the BS 502 is broken, and a newconnection between the MS 505 and BS 504 is established. The BS 504 alsoreceives directly from the BS 502 a set of content sharing informationassociated with the MS 505 to minimize any disruption to thecommunication session conducted by the MS 505 via the BS 502. Thisprocess of transferring control from one BS to another is referred to asa hard handoff.

FIG. 5B illustrates another type of a handoff, arranged in accordancewith embodiments of the present disclosure. Unlike the hard handoffdiscussed above, the three BS's, a BS 512, a BS 514, and a BS 516communicate with one another from time to time and try to keep the setof content sharing information associated with a MS 515 current.Moreover, when the MS 515 indeed moves from one coverage area of the BS512 into another coverage area of the BS 514, the connection between theMS 515 and the BS 512 is retained while a new connection between the MS515 and the BS 514 is established. The interval, during which the twoconnections are used in parallel, may be brief. This process oftransferring control is referred to as a soft handoff. With the threeBS's sharing the current content sharing information of the MS 515, thesoft handoff approach is useful to a MS that frequently moves in and outof the coverage areas of different BS's.

In addition, the aforementioned peer discovery process is re-initiated,so that a MSC managing the BS 502 and the BS 504 can re-establishconnection with the MS 505 at its new location. Some examples of the setof content sharing information transferred in the handoff from the BS502 to the BS 504 may include, without limitation, location of the MS505, identification of the MS 505, and relevant information regardingthe content that the MS 505 may be transferring or has transferred atthe time of the handoff.

Having described several mechanisms used in a centralized control planefor a P2P wireless network, in one implementation, the data plane forthe P2P wireless network is designed to support both a distributivemodel and a centralized model. Using the transfer of certain requestedcontent as an example, if a first MS with the requested content and asecond MS making the request are sufficiently close to each other, thenin some implementations, the first MS transfers the content directly tothe second MS. In other words, the content transfer occurs directlybetween two peers. This is an example of the distributive model for thedata plane. On the other hand, if the two MS's are not close to eachother, then the first MS sends the content to the appropriate BS for itto send to the second MS. In other words, the content transfer occursindirectly (i.e., via the BS) between the two peers. This is an exampleof the centralized model for the data plane.

FIG. 6 is a flow chart illustrating a process for handling data transferamong peers in a P2P wireless network, arranged in accordance withembodiments of the present disclosure. In operation 602, after a firstMS making the request for content receives the location of a second MSwith the requested content, the first MS determines whether the contentlocation of the second MS is close enough to establish a direct P2Ptransmission. In some example implementations, the first MS establishesa distance between the first MS and the second MS and compares thedistance against a threshold value. If the distance is sufficientlyclose (i.e., distance is less than the threshold value), then inoperation 604, the two MS's establish a direct communication with eachother so that data transfer for the requested content is accomplishedvia a direct P2P transmission between the two MS's. However, if thefirst MS determines that the distance is not close enough based on thethreshold value, then in operation 606, the two MS's establish anindirect communication so that data transfer is accomplished for therequested content by an indirect P2P transmission through at least oneBS. The technologies that can be used for the direct transmissionbetween the peers include, without limitation, utilizing an existingWLAN communication link in an ad hoc network and using directcommunication through the cellular network frequency range.

During the data transfer from two peers in a P2P wireless network, datamay be divided into multiple chunks. Transferring chunks of content, asopposed to the entire content, should increase transmission efficiencyand minimize data losses due to connection failures. In someimplementations, the size of each chunk is an increasing function of thenumbers of the MS's covered by a BS in the P2P wireless network and alsothe average duration in which the MS's are linked to the BS. Oneequation to determine the chunk size is as follow:

K=gamma*T2

where K is the chunk size; gamma is a pre-determined constant; and T2 isthe average duration in which the MS's are linked to the BS. Theseparameters are related to whether a connection for transferring contentis stable or not. If the communication link is determined to be stable,then a larger sized chunk can be transferred. Otherwise, a smaller sizedchunk can be transferred, since the connection is more likely to sufferfailures. With smaller sized chunks, substantial waste of transmissioncan be avoided, especially if the connection failure occurs during thetransmission of a chunk.

Yet another transmission scheme makes use of the inherent broadcastmedium in a P2P wireless network. In some example implementations, a BSinserts a header to identity the type of content. For example, theheader may include a short description or a key word associated with thecontent. Then, the BS broadcasts the header and the content to the MS'sthat are within the coverage area of the BS. A MS in the coverage areacan decide whether to download the content based on the headerinformation. In addition, the MS may also further decipher the headerinformation and retrieve the location of the content and use thelocation information to quickly download of the content.

In addition to efficiently and reliably transmitting content in a P2Pwireless network, another possible contributing factor to drive adoptionis to ensure richness of content in the P2P wireless network.

In some approaches, a MS covered by a particular BS and with content isgiven incentives to initiate uploading of the content to the BS wheneverit is in an advantaged position. This MS with the content is referred toas a producer MS. One way to determine whether the producer MS is in anadvantage position is based on its channel condition.

FIG. 7 is a flow chart illustrating a process of uploading content to aBS, arranged in accordance with embodiments of the present disclosure.Without having received any requests from a P2P wireless network for thecontent, a MS in operation 702 initiates the uploading of the content.The MS may be given certain incentives to initiate proactively. Inoperation 704, a signal-to-interference ratio (SIR) associated with theMS is determined and compared to a pre-determined threshold. The SIRmeasures the ratio of a received signal strength (S) to a total receivedinterference strength (I). If the SIR is high (e.g., at or above thepre-determined threshold), then the channel condition is likely moresuitable for transmission than if the SIR is low (e.g., below thepre-determined threshold). If the channel condition is good, then theupload speed can also be high. Here, if the SIR exceeds thepre-determined threshold, then the MS is considered to be in anadvantageous position, and the uploading of the content to the BS canbegin in operation 706. On the other hand, if the threshold is notreached, then the SIR is re-calculated until reaching the threshold. Insome implementations, the MS is configured to track the number ofattempts to check the SIR and then terminate the process shown in FIG. 7for failing to exceed the pre-determined threshold within a certainnumber of attempts.

To encourage content upload, one incentive mechanisms is to offerrewards for contributing content and spending power to upload content.In some implementations, rewards may be provided in the form of virtualmoney, also referred to as a token. Alternatively, rewards can also bereal money and can be added or deduced in a monthly payment bill. Insome example implementations, a MS contributing content receives a tokenwhen the content is downloaded by other MS's. To reward the contentcontributor, the incentive mechanism charges a content requester for thecontent that it receives.

FIG. 8 is a simplified diagram illustrating a virtual money path in anincentive mechanism 800 for a P2P wireless network, arranged inaccordance with embodiments of the present disclosure. In some exampleimplementations, a BS 806 covering one or more MS's, such as a first MS802 and a second MS 804, is responsible for distributing and collectingvirtual money, such as tokens. Moreover, a MSC 808 manages the number oftokens to be controlled by the BS 806, and the BS 806 may update the MSC808 from time to time regarding whether the MS's are sufficientlyincentivized to upload data or appropriately charged to receive data.

It is worth noting that the illustrated virtual money path and the datapath (not shown) in the P2P wireless network are in opposite directionsof each other. When a first MS 802 (a content contributor) uploadscontent in one direction to the BS 806, the first MS 802 receives anumber of tokens based on the number of times the content is downloadedfrom the BS 806 in another direction. When a second MS 804 (a contentrequester) requests for certain content, the second MS 804 pays acertain number of tokens to the BS 806 to download the content. Thenumber of tokens, as mentioned above, is determined by the MSC 808.

For some examples the content may go through more than one BS (thoughnot shown in FIG. 8) for the first MS 802 to deliver the content to thesecond MS 804. When these BS's are also managed by the MSC 808, the MSC808 allocates a certain number of tokens for each of the BS's along thepath to distribute to its covered MS's.

To minimize potentially unfair outcome in the incentive mechanism, atransmit power based credit system may be used to discourage aggressivecontent uploading. When a MS aggressively uploads content to a BS tomaximize the rewards received, such an action may interfere with otherMS's from uploading to the BS. These MS's may be in advantaged positionsto efficiently upload their respective content. These MS's may also havemore desirable content. In some implementations, a transmit power basedcredit system can be utilized to determine the number of tokens awardedto a MS that uploads content based on the transmit power of the MS. Forexample, if the transmit power of a MS is high, then the MS may receivea smaller number of tokens. With high transmit power, the MS maytransmit more content and thus may be seen as a potential candidate foraggressive content uploading. Also, the high transmit power of the MSmay interfere with other content sharing transmissions. On the otherhand, a MS with lower transmit power may receive a larger number oftokens. The larger token reward is meant to encourage the MS's withlower transmit power to upload content to the BS, since such MS's arelikely to be in advantaged positions of the network. The transmit powerof a MS can be determined by a BS covering the MS.

FIG. 9A is a flow chart illustrating a process 900 for administering atransmit power credit based system, arranged in accordance withembodiments of the present disclosure. In operation 902, the BS receivesa request to upload content from a MS covered in the wireless range ofthe BS. In operation 904, the BS determines the transmit power of the MSaccording to the signals received from the MS. The BS calculates thenumber of tokens (i.e., the token amount) to award the MS based on thetransmit power of the MS in operation 906 and distributes the tokens tothe MS in operation 908. In some implementations, the informationregarding the transmit power of the MS may be transmitted to the MSC tobe stored in the centralized database associated with the MSC.

To avoid blocking out content-rich but location disadvantaged MS's ofuploading opportunities, the transmit power based credit systemdiscussed above may be supplemented with a location fairness mechanism.For example, when a MS is at the boundaries of the wireless ranges ofdifferent BS's, the MS is likely to be associated with a low SIR and isunsuitable to transmit data. However, the MS may have desirable contentto contribute.

FIG. 9B is a flow chart illustrating a process 950 for adjusting atransmit power credit based system, arranged in accordance withembodiments of the present disclosure. Similar to the process 900 ofFIG. 9A, a BS receives a request to upload content from a MS inoperation 952. The BS also receives the location of the MS anddetermines the transmit power of the MS in operations 954 and 956,respectively. The location of the MS helps the BS in determining thetransmit power of the MS. In some implementations, the informationreceived by the BS is further transmitted to a MSC managing the BS. TheMSC, with access to a centralized database storing data from both theBS's managed by the MSC and from the MS's covered by such BS's asdescribed above, is configured to determine whether the content the MSrequesting to upload is desirable. One way for the MSC to determine thedesirability of content is based on the number of requests for suchcontent from all the MS's managed by the MSC. In operation 958, the MSCestablishes a scalar compensation factor according to the desirabilityof the content requested to be uploaded. Then, the MSC in operation 960calculates the appropriate amount of virtual money, or a token amount,to award the MS based on both the transmit power and also the scalarcompensation factor. For example, even if the transmit power is low,suggesting the MS being in an advantaged position, the token amount maystill be reduced using the scalar compensation factor if the content isconsidered to be undesirable. Conversely, if the transmit power if high,suggesting the MS being a disadvantaged position, the token amount maystill be increased if the content is considered to be desirable.

In some alternatively implementations, a BS, instead of a MSC, may beconfigured to perform some or even all of the operations in the process950. It should be apparent to a person having ordinary skills in the artto implement a system, in which the BS exchanges all the relevant datawith the MSC to perform the location fairness mechanism.

FIG. 10 is a block diagram illustrating a computer program product 1000of a software module for a MS, a BS, or a MSC, arranged in accordancewith embodiments of the present disclosure. Computer program product1000 includes one or more sets of instructions 1002 for executing themethods of the software module. Computer program product 1000 may betransmitted in a signal bearing medium 1004 or another similarcommunication medium. Computer program product 1000 may be recorded in acomputer readable medium 1006 or another similar recordable medium 1008.

There is little distinction left between hardware and softwareimplementations of aspects of systems; the use of hardware or softwareis generally (but not always, in that in certain contexts the choicebetween hardware and software can become significant) a design choicerepresenting cost vs. efficiency tradeoffs. There are various vehiclesby which processes and/or systems and/or other technologies describedherein can be effected (e.g., hardware, software, and/or firmware), andthat the preferred vehicle will vary with the context in which theprocesses and/or systems and/or other technologies are deployed. Forexample, if an implementer determines that speed and accuracy areparamount, the implementer may opt for a mainly hardware and/or firmwarevehicle; if flexibility is paramount, the implementer may opt for amainly software implementation; or, yet again alternatively, theimplementer may opt for some combination of hardware, software, and/orfirmware.

The foregoing detailed description has set forth various embodiments ofthe devices and/or processes via the use of block diagrams, flowcharts,and/or examples. Insofar as such block diagrams, flowcharts, and/orexamples contain one or more functions and/or operations, it will beunderstood by those within the art that each function and/or operationwithin such block diagrams, flowcharts, or examples can be implemented,individually and/or collectively, by a wide range of hardware, software,firmware, or virtually any combination thereof. In one embodiment,several portions of the subject matter described herein may beimplemented via Application Specific Integrated Circuits (ASICs), FieldProgrammable Gate Arrays (FPGAs), digital signal processors (DSPs), orother integrated formats. However, those skilled in the art willrecognize that some aspects of the embodiments disclosed herein, inwhole or in part, can be equivalently implemented in integratedcircuits, as one or more computer programs running on one or morecomputers (e.g., as one or more programs running on one or more computersystems), as one or more programs running on one or more processors(e.g., as one or more programs running on one or more microprocessors),as firmware, or as virtually any combination thereof, and that designingthe circuitry and/or writing the code for the software and or firmwarewould be well within the skill of one of skill in the art in light ofthis disclosure. In addition, those skilled in the art will appreciatethat the mechanisms of the subject matter described herein are capableof being distributed as a program product in a variety of forms, andthat an illustrative embodiment of the subject matter described hereinapplies regardless of the particular type of signal bearing medium usedto actually carry out the distribution. Examples of a signal bearingmedium include, but are not limited to, the following: a recordable typemedium such as a floppy disk, a hard disk drive, a Compact Disc (CD), aDigital Video Disk (DVD), a digital tape, a computer memory, etc.; and atransmission type medium such as a digital and/or an analogcommunication medium (e.g., a fiber optic cable, a waveguide, a wiredcommunications link, a wireless communication link, etc.).

Those skilled in the art will recognize that it is common within the artto describe devices and/or processes in the fashion set forth herein,and thereafter use engineering practices to integrate such describeddevices and/or processes into data processing systems. That is, at leasta portion of the devices and/or processes described herein can beintegrated into a data processing system via a reasonable amount ofexperimentation. Those having skill in the art will recognize that atypical data processing system generally includes one or more of asystem unit housing, a video display device, a memory such as volatileand non-volatile memory, processors such as microprocessors and digitalsignal processors, computational entities such as operating systems,drivers, graphical user interfaces, and applications programs, one ormore interaction devices, such as a touch pad or screen, and/or controlsystems including feedback loops and control motors (e.g., feedback forsensing position and/or velocity; control motors for moving and/oradjusting components and/or quantities). A typical data processingsystem may be implemented utilizing any suitable commercially availablecomponents, such as those typically found in datacomputing/communication and/or network computing/communication systems.

The herein described subject matter sometimes illustrates differentcomponents contained within, or connected with, different othercomponents. It is to be understood that such depicted architectures aremerely exemplary, and that in fact many other architectures can beimplemented which achieve the same functionality. In a conceptual sense,any arrangement of components to achieve the same functionality iseffectively “associated” such that the desired functionality isachieved. Hence, any two components herein combined to achieve aparticular functionality can be seen as “associated with” each othersuch that the desired functionality is achieved, irrespective ofarchitectures or intermedial components. Likewise, any two components soassociated can also be viewed as being “operably connected”, or“operably coupled”, to each other to achieve the desired functionality,and any two components capable of being so associated can also be viewedas being “operably couplable”, to each other to achieve the desiredfunctionality. Specific examples of operably couplable include but arenot limited to physically mateable and/or physically interactingcomponents and/or wirelessly interactable and/or wirelessly interactingcomponents and/or logically interacting and/or logically interactablecomponents.

With respect to the use of substantially any plural and/or singularterms herein, those having skill in the art can translate from theplural to the singular and/or from the singular to the plural as isappropriate to the context and/or application. The varioussingular/plural permutations may be expressly set forth herein for sakeof clarity.

It will be understood by those within the art that, in general, termsused herein, and especially in the appended claims (e.g., bodies of theappended claims) are generally intended as “open” terms (e.g., the term“including” should be interpreted as “including but not limited to,” theterm “having” should be interpreted as “having at least,” the term“includes” should be interpreted as “includes but is not limited to,”etc.). It will be further understood by those within the art that if aspecific number of an introduced claim recitation is intended, such anintent will be explicitly recited in the claim, and in the absence ofsuch recitation no such intent is present. For example, as an aid tounderstanding, the following appended claims may contain usage of theintroductory phrases “at least one” and “one or more” to introduce claimrecitations. However, the use of such phrases should not be construed toimply that the introduction of a claim recitation by the indefinitearticles “a” or “an” limits any particular claim containing suchintroduced claim recitation to disclosures containing only one suchrecitation, even when the same claim includes the introductory phrases“one or more” or “at least one” and indefinite articles such as “a” or“an” (e.g., “a” and/or “an” should typically be interpreted to mean “atleast one” or “one or more”); the same holds true for the use ofdefinite articles used to introduce claim recitations. In addition, evenif a specific number of an introduced claim recitation is explicitlyrecited, those skilled in the art will recognize that such recitationshould typically be interpreted to mean at least the recited number(e.g., the bare recitation of “two recitations,” without othermodifiers, typically means at least two recitations, or two or morerecitations). Furthermore, in those instances where a conventionanalogous to “at least one of A, B, and C, etc.” is used, in generalsuch a construction is intended in the sense one having skill in the artwould understand the convention (e.g., “a system having at least one ofA, B, and C” would include but not be limited to systems that have Aalone, B alone, C alone, A and B together, A and C together, B and Ctogether, and/or A, B, and C together, etc.). In those instances where aconvention analogous to “at least one of A, B, or C, etc.” is used, ingeneral such a construction is intended in the sense one having skill inthe art would understand the convention (e.g., “a system having at leastone of A, B, or C” would include but not be limited to systems that haveA alone, B alone, C alone, A and B together, A and C together, B and Ctogether, and/or A, B, and C together, etc.). It will be furtherunderstood by those within the art that virtually any disjunctive wordand/or phrase presenting two or more alternative terms, whether in thedescription, claims, or drawings, should be understood to contemplatethe possibilities of including one of the terms, either of the terms, orboth terms. For example, the phrase “A or B” will be understood toinclude the possibilities of “A” or “B” or “A and B.”

While various aspects and embodiments have been disclosed herein, otheraspects and embodiments will be apparent to those skilled in the art.The various aspects and embodiments disclosed herein are for purposes ofillustration and are not intended to be limiting, with the true scopeand spirit being indicated by the following claims.

1-21. (canceled)
 22. A method for transmitting data in a wirelessnetwork, comprising: determining a channel condition for datatransmission in the wireless network; identifying an anticipated rewardfor data transmission in the wireless network; and transmitting contentto a base station in the wireless network prior to receiving a requestfor the content and when the channel condition and the anticipatedreward satisfy threshold values.
 23. The method of claim 22, furthercomprising: receiving a chunk size that is established based onstability of a connection to the base station; and splitting the contentbased on the chunk size.
 24. The method of claim 22, further comprisingdirectly transmitting the content to a peer in the wireless network whena distance to the peer satisfies a distance threshold value.
 25. Adevice configured to transmit data in a wireless network, the devicecomprising: a memory unit; and a processing unit, wherein the processingunit is configured to determine a channel condition for datatransmission in the wireless network, identify an anticipated reward fordata transmission in the wireless network, and transmit content to abase station in the wireless network prior to receiving a request forthe content and when the channel condition and the anticipated rewardsatisfy threshold values.
 26. The device of claim 25, wherein theprocessing unit is further configured to split the content based on achunk size that correlates with stability of a connection to the basestation.
 27. The device of claim 25, wherein the processing unit isfurther configured to cause a direct transmission of the content to apeer in the wireless network when a distance to the peer satisfies adistance threshold value.
 28. A computer readable medium containing asequence of instructions for transmitting data in a wireless network ina wireless network, which when executed by a device, causes the deviceto: determine a channel condition for data transmission in the wirelessnetwork; identify an anticipated reward for data transmission in thewireless network; and transmit content to a base station in the wirelessnetwork prior to receiving a request for the content and when thechannel condition and the anticipated reward satisfy threshold values.29. A method for distributing a reward to a mobile device for uploadingcontent in a wireless network, comprising: determining a channelcondition for a communication channel used by the mobile device;establishing an amount of the reward based on the channel condition;receiving the content from the mobile device over the communicationchannel; and transmitting the reward to the mobile device in response toreceiving the content.
 30. The method of claim 29, further comprisingmodifying the amount of the reward based on a number of times thecontent is downloaded.
 31. The method of claim 29, further comprisingreceiving compensation for the content before allowing the content to bedownloaded.
 32. A computing device configured to incentivize uploadingof content from a device in a wireless network, comprising: a memoryunit; and a processing unit, wherein the processing unit is configuredto: determine a channel condition for a communication channel used bythe device; establish an amount of a reward based on the channelcondition; receive the content over the communication channel from thedevice; and transmit the reward to the device in response to receivingthe content.
 33. The computing device of claim 32, wherein theprocessing unit is further configured to modify the amount of the rewardbased on a number of times the content is downloaded.
 34. The computingdevice of claim 32, wherein the processing unit is further configured toreceive compensation for the content before allowing the content to bedownloaded.
 35. A computer readable medium containing a sequence ofinstructions for incentivize uploading of content from a device in awireless network, which when executed by a computing device, causes thecomputing device to: determine a channel condition for a communicationchannel used by the device, establish an amount of a reward based on thechannel condition; receive the content over the communication channelfrom the device; and transmit the reward to the device in response toreceiving the content.
 36. A wireless network system configured toincentivize uploading of content from a mobile device, comprising: amobile switching center configured to manage a base station, wherein thebase station is further configured to determine a channel condition fora communication channel between the base station and the mobile devicein a wireless range of the base station, receive an amount of a rewardfrom the mobile switching center, wherein the amount is establishedbased on the channel condition; and transmit the reward to the mobiledevice in response to receiving the content from the first mobiledevice.
 37. The wireless network system of claim 36, wherein the mobileswitching center is further configured to modify the amount of thereward based on a number of times the content is downloaded.
 38. Thewireless network system of claim 36, wherein the base station is furtherconfigured to receive compensation from another mobile device in thewireless range for the content before allowing the other mobile deviceto download the content.